A tunable hybrid memory allocator q Yusuf
نویسندگان
چکیده
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. Bad memory management causes severe waste of memory, several times that actually needed, in programs. It can also cause degradation in performance. Many widely used allocators waste memory and/or CPU time. Since computer memory is an expensive and limited resource its efficient utilization is necessary. There cannot exist a memory allocator that will deliver best performance and least memory consumption for all programs and therefore easily tunable allocators are required. General purpose allocators that come with operating systems give less than optimal performance or memory consumption. An allocator with a few tunable parameters can be tailored to a program s needs for optimal performance and memory consumption. Our tunable hybrid allocator design shows 11–54% better performance and nearly equal memory consumption when compared to the well known Doug Lea allocator in seven benchmark programs. 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Adaptive Tunable Vibration Absorber using Shape Memory Alloy
This study presents a new approach to control the nonlinear dynamics of an adaptive absorber using shape memory alloy (SMA) element. Shape memory alloys are classified as smart materials that can remember their original shape after deformation. Stress and temperature-induced phase transformations are two typical behaviors of shape memory alloys. Changing the stiffness associated with phase tran...
متن کاملA Scalable and Eecient Storage Allocator on Shared-memory Multiprocessors
An eecient dynamic storage allocator is important for time-critical parallel programs. In this paper, we present a fast and simple parallel allocator for xed size block on shared-memory multiprocessors. We show both theoretically and empirically that the allocator incurs very low lock contention. The allocator is tested with parallel simulation applications with frequent allocation and release ...
متن کاملThe Slab Allocator: An Object-Caching Kernel Memory Allocator
This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of allocating complex objects by retaining their state between uses. These same primitives prove equally effective for managing stateless memory (e.g. data pages and temporary buffers) because they are space-efficient an...
متن کاملA Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors
An eecient dynamic storage allocator is important for time-critical parallel programs. In this paper, we present a fast and simple parallel allocator for xed size block on shared-memory multiprocessors. We show both theoretically and empirically that the allocator incurs very low lock contention. The allocator is tested with parallel simulation applications with frequent allocation and release ...
متن کاملA Scalable Concurrent malloc(3) Implementation for FreeBSD
The FreeBSD project has been engaged in ongoing work to provide scalable support for multi-processor computer systems since version 5. Sufficient progress has been made that the C library’s malloc(3) memory allocator is now a potential bottleneck for multi-threaded applications running on multiprocessor systems. In this paper, I present a new memory allocator that builds on the state of the art...
متن کامل